Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
نویسندگان
چکیده
منابع مشابه
Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
Consider the following due-date scheduling problem in a multiclass, acyclic, single-station service system: Any class k job arriving at time t must be served by its due date t+Dk. Equivalently, its delay k must not exceed a given delay or lead-time Dk. In a stochastic system, the constraint k Dk must be interpreted in a probabilistic sense. Regardless of the precise probabilistic formulation, h...
متن کاملDual Scheduling Algorithm In A Generalized Switch: Asymptotic Optimality And Throughput Optimality
Generalized switch is a model of a queueing system where parallel servers are interdependent and have time-varying service capabilities. It includes as special cases the model of data scheduling in a wireless network and the input-queued cross-bar switch model. A finite set S of queues (users) are served in discrete time by a switch. Switch state h follows a discrete-time, finite-state Markov c...
متن کاملLargest Weighted Delay First Scheduling : Large Deviations and Optimality
We consider a single server system with N input flows. We assume that each flow has stationary increments and satisfies a sample path large deviation principle, and that the system is stable. We introduce the largest weighted delay first (LWDF) queueing discipline associated with any given weight vector α = α1 αN . We show that under the LWDF discipline the sequence of scaled stationary distrib...
متن کاملStability and Asymptotic Optimality of Generalized MaxWeight Policies
It is shown that stability of the celebrated MaxWeight or back pressure policies is a consequence of the following interpretation: either policy is myopic with respect to a surrogate value function of a very special form, in which the “marginal disutility” at a buffer vanishes for vanishingly small buffer population. This observation motivates the h-MaxWeight policy, defined for a wide class of...
متن کاملScheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule
We consider a queueing system with multitype customers and flexible (multiskilled) servers that work in parallel. If Qi is the queue length of type i customers, this queue incurs cost at the rate of Ci Qi , where Ci · is increasing and convex. We analyze the system in heavy traffic (Harrison and Lopez 1999) and show that a very simple generalized c -rule (Van Mieghem 1995) minimizes both instan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2003
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.51.1.113.12793